A Class of Parseval Fusion Frames for Probabilistic Erasures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal dual fusion frames for probabilistic erasures

For any fixed fusion frame, its optimal dual fusion frames for reconstruction is studied in case of erasures of subspaces. It is considered that a probability distribution of erasure of subspaces is given and that a blind reconstruction procedure is used, where the erased data are set to zero. It is proved that there are always optimal duals. Sufficient conditions for the canonical dual fusion ...

متن کامل

Excess of Parseval Frames

The excess of a sequence in a Hilbert space H is the greatest number of elements that can be removed yet leave a set with the same closed span. This paper proves that if F is a frame for H and there exist infinitely many elements gn ∈ F such that F \ {gn} is complete for each individual n and if there is a uniform lower frame bound L for each frame F \ {gn}, then for each ε > 0 there exists an ...

متن کامل

A Fundamental Identity for Parseval Frames

Frames are an essential tool for many emerging applications such as data transmission. Their main advantage is the fact that frames can be designed to be redundant while still providing reconstruction formulas. This makes them robust against noise and losses while allowing freedom in design (see, for example, [5, 10]). Due to their numerical stability, tight frames and Parseval frames are of in...

متن کامل

A New Identity for Parseval Frames

In this paper we establish a surprising new identity for Parseval frames in a Hilbert space. Several variations of this result are given, including an extension to general frames. Finally, we discuss the derived results.

متن کامل

Frames, Graphs and Erasures

Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2018

ISSN: 1877-0509

DOI: 10.1016/j.procs.2018.04.293